An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem
نویسندگان
چکیده
In this paper, we will introduce an exact algorithm with a time complexity of O(1.299) for the weighted mutually exclusive set cover problem, where m is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.
منابع مشابه
An exact algorithm for the weighed mutually exclusive maximum set cover problem
In this paper, we introduce an exact algorithm with a time complexity of O(1.325) for the weighted mutually exclusive maximum set cover problem, where m is the number of subsets in the problem. This is an NP-hard motivated and abstracted from a bioinformatics problem of identifying signaling pathways based gene mutations. Currently, this probelm is addressed using heuristic algorithms, which ca...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1302.5820 شماره
صفحات -
تاریخ انتشار 2013